Automatic decidability and combinability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A rule-based system for automatic decidability and combinability

This paper deals with decision procedures specified by using a superposition calculus which is an inference system at the core of all equational theorem provers. This calculus is refutation complete: it provides a semi-decision procedure that halts on unsatisfiable inputs but may diverge on satisfiable ones. Fortunately, it may also terminate for some theories of interest in verification, and t...

متن کامل

Automatic Decidability

We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such ...

متن کامل

Decidability and Complexity in Automatic Monoids

We prove several complexity and decidability results for automatic monoids: (i) there exists an automatic monoid with a P-complete word problem, (ii) there exists an automatic monoid such that the firstorder theory of the corresponding Cayley-graph is not elementary decidable, and (iii) there exists an automatic monoid such that reachability in the corresponding Cayley-graph is undecidable. Mor...

متن کامل

Automatic Decidability for Theories with Counting Operators

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...

متن کامل

Combinability of phylogenies and bootstrap confidence envelopes.

Recently, Lutzoni (1997) used a test described by Rodrigo et al. (1993; hereinafter referred to as the RKB3 test) to compare phylogenies constructed by using ribosomal RNA gene sequences (rDNA) and intergenic transcribed spacer sequences (ITS) from a group of related basidiomycete species. Lut-zoni discussed the relationships amongst the species, but he also commented extensively on the RKB3 te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2011

ISSN: 0890-5401

DOI: 10.1016/j.ic.2011.03.005